Bun splitting: a practical cutting stock problem

نویسندگان

  • Celia A. Glass
  • Jeroen M. van Oostrum
چکیده

We describe a new hierarchical 2D-guillotine Cutting Stock Problem. In contrast to the classic cutting stock problem, waste is not an issue. The problem relates to the removal of a defective part and assembly of the remaining parts into homogeneous size blocks. The context is the packing stages of cake manufacturing. The company’s primary objective is to minimise total processing time at the subsequent, packing stage. This objective reduces to one of minimising the number of parts produced when cutting the tray load of buns. We offer a closed form optimization approach to this class of problems for certain cases, without recourse to mathematical programming or heuristics. The methodology is demonstrated through a case study in which the number of parts is reduced by almost a fifth, and the manufacturer’s subsidiary requirement to reduce isolated single bun parts and hence customer complaints is also satisfied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A simple approach to the two-dimensional guillotine cutting stock problem

Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...

متن کامل

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

متن کامل

The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost

Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...

متن کامل

Solving an one-dimensional cutting stock problem by simulated annealing and tabu search

A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Annals OR

دوره 179  شماره 

صفحات  -

تاریخ انتشار 2010